Erratum to “A Minimax Ordering Policy for the Infinite Stage Dynamic Inventory Problem”

A Queueing-Inventory System with Repair Center for Defective Items and One-for-One Ordering Policy

In this paper we consider a system consisting of a supplier with a single processing unit, a repair center, and a retailer with Poisson demand. We assume that the retailer applies one-for-one ordering policy with backorders for his inventory control. The retailer’s orders form a queue in the supplier processing unit. We also assume that a certain fraction of the products produced by the supplie...

Queueing Inventory System in a Two-level Supply Chain with One-for-One Ordering Policy

Consider a two-level inventory system consisting of one supplier and one retailer. The retailer faces a Poisson demand with a known rate and applies base stock (one-for-one ordering) policy. That is, his inventory position is set to a pre-determined level, so the demand pattern is transferred exactly to the supplier. The supplier has an inventory system and a service unit with exponentially dis...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

A Hybrid Dynamic Programming for Inventory Routing Problem in Collaborative Reverse Supply Chains

Inventory routing problems arise as simultaneous decisions in inventory and routing optimization. In the present study, vendor managed inventory is proposed as a collaborative model for reverse supply chains and the optimization problem is modeled in terms of an inventory routing problem. The studied reverse supply chains include several return generators and recovery centers and one collection...

Minimax R-stage strategy for the multi-armed bandit problem